|
Nimrod Megiddo ((ヘブライ語:נמרוד מגידו)) is a mathematician and computer scientist. He is a research scientist at the IBM Almaden Research Center. His interests include optimization, algorithm design and analysis, game theory, and machine learning.〔〔(Nimrod Megiddo bibliography ) at DBLP Bibliography Server〕 Megiddo received his Ph.D. in mathematics from the Hebrew University of Jerusalem.〔(Author's profile at an article ), ''Computer'', April 2004, p. 11〕 Megiddo received the 2014 John von Neumann Theory Prize and is a 1992 Frederick W. Lanchester Prize recipient. ==Achievements== In computational geometry, Megiddo is known for his prune and search technique suggested in 1983 〔N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Computing, 12:759–776, 1983.〕 and used for various computational geometric optimization problems, in particular to solve the smallest-circle problem in linear time. In 2009 he received the INFORMS Fellows award for contributions to the theory and application of mathematical programming, including parametric searches, interior point methods, low dimension Linear Programming, probabilistic analysis of the simplex method and computational game theory (https://www.informs.org/Connect-with-People/Fellows/INFORMS-Fellows-Class-of-20092). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Nimrod Megiddo」の詳細全文を読む スポンサード リンク
|